Survey on Polygonal Approximation Techniques for Digital Planar Curves
نویسندگان
چکیده
Polygon approximation plays a vital role in abquitious applications like multimedia, geographic and object recognition. An extensive number of polygonal approximation techniques for digital planar curves have been proposed over the last decade, but there are no survey papers on recently proposed techniques. Polygon is a collection of edges and vertices. Objects are represented using edges and vertices or contour points (ie. polygon). Polygonal approximation is representing the object with less number of dominant points (less number of edges and vertices). Polygon approximation results in less computational speed and memory usage. This paper deals with comparative study on polygonal approximation techniques for digital planar curves with respect to their computation and efficiency.
منابع مشابه
Comparative Study on Polygonal Approximation Techniques for Digital planar curves
Polygon approximation plays a vital role in abquitious applications like multimedia, geographic and object recognition . An extensive number of polygonal approximation techniques for digital planar curves have been proposed over the last decade, but there are no comparative study of recently proposed techniques. Polygons are collection of large number of vertices and edges. The approach, polygo...
متن کاملPolygonal approximation of digital planar curves through adaptive optimizations
In this paper, we present a novel non-parametric polygonal approximation algorithm for digital planar curves. The proposed algorithm first selects a set of points (called cut-points) on the contour which are of very ‘high’ curvature. An optimization procedure is then applied to find adaptively the best fitting polygonal approximations for the different segments of the contour as defined by the ...
متن کاملA new iterative approach for dominant points extraction in planar curves
In this paper the problem of dominant point detection on digital curves is addressed. Based on an initial set of curvature points, our approach adds iteratively significant points by looking for the higher curvature contour points. The process continues until all the sums of the distances of contour points in the arcs subtended to the chord between two next dominant points is less then a predef...
متن کاملA Survey and a New Competitive Method for the Planar min-# Problem
We develop a new technique for planar polygonal chain simplification based on a digital geometry object: the digital line. We first survey most of the different types of approximation algorithms which minimize the number of output vertices. We present their main qualities and their inherent drawbacks. Then we introduce our approximation method and improve it in order to obtain all the advantage...
متن کاملMinimum-Length Polygons in Approximation Sausages
The paper introduces a new approximation scheme for planar digital curves. This scheme defines an approximating sausage ‘around’ the given digital curve, and calculates a minimum-length polygon in this approximating sausage. The length of the polygon is taken as an estimator for the length of the curve being the (unknown) preimage of the given digital curve. Assuming finer and finer grid resolu...
متن کامل